Maximizing Utility of Sensor-Mission Assignment with Uncertain Demands

نویسندگان

  • Diego Pizzocaro
  • Matthew P. Johnson
  • Hosam Rowaihy
  • Stuart Chalmers
  • Alun Preece
  • Amotz Bar-Noy
  • Thomas La Porta
چکیده

A sensor network in the field is usually required to support multiple sensing tasks or missions to be accomplished simultaneously. Since missions might compete for the exclusive usage of the same sensing resource we need to assign individual sensors to missions. Missions are usually characterized by an uncertain demand for sensing resource capabilities. Consider for example a mission that requires video sensors to identify a target but the weather conditions and visibility range in the field are not exactly known: in this case the required number of sensors and the resolution of their cameras cannot be precisely determined. We can for example specify only the highest resolution of the cameras needed by the mission or the maximum number of video sensors required. If instead two missions require to identify two different targets that are located in nearby regions on the map, then these missions might compete for the exclusive control of a particular video sensor. Indeed the mission to which the video sensor will be assigned might decide to point the camera in a direction that could be completely opposite to where the other mission would require it.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Frugal Sensor Assignment

When a sensor network is deployed in the field it is typically required to support multiple simultaneous missions, which may start and finish at different times. Schemes that match sensor resources to mission demands thus become necessary. In this paper, we consider new sensor-assignment problems motivated by frugality, i.e., the conservation of resources, for both static and dynamic settings. ...

متن کامل

A hybrid CS-SA intelligent approach to solve uncertain dynamic facility layout problems considering dependency of demands

This paper aims at proposing a quadratic assignment-based mathematical model to deal with the stochastic dynamic facility layout problem. In this problem, product demands are assumed to be dependent normally distributed random variables with known probability density function and covariance that change from period to period at random. To solve the proposed model, a novel hybrid intelligent algo...

متن کامل

SCUB: A Distributed, Utility-based Architecture for Closed Loop Control with Wireless Sensor Networks

This paper develops an architecture for task assignment in wireless sensor networks in support of closed-loop tactical operations. Our approach is based on a mathematical framework, which, based on multi-attribute utility theory, allows either end-users to easily express the value (utility) that they would attach to sensor information based on features associated with the data, such as the geog...

متن کامل

Robust Quadratic Assignment Problem with Uncertain Locations

 We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...

متن کامل

A novel versatile architecture for autonomous underwater vehicle's motion planning and task assignment

Expansion of today's underwater scenarios and missions necessitates the requestion for robust decision making of the Autonomous Underwater Vehicle (AUV); hence, design an efficient decision making framework is essential for maximizing the mission productivity in a restricted time. This paper focuses on developing a deliberative conflict-free-task assignment architecture encompassing a Global Ro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008